翻訳と辞書 Words near each other ・ 2-Carboxy-D-arabinitol-1-phosphatase ・ 2-category ・ 2-chloro-4-carboxymethylenebut-2-en-1,4-olide isomerase ・ 2-Chloro-9,10-bis(phenylethynyl)anthracene ・ 2-Chloro-9,10-diphenylanthracene ・ 2-Chloro-m-cresol ・ 2-chlorobenzoate 1,2-dioxygenase ・ 2-Chlorobenzoic acid ・ 2-Chlorobutane ・ 2-Chloroethanesulfonyl chloride ・ 2-Chloroethanol ・ 2-Chlorophenol ・ 2-Chloropropionic acid ・ 2-Chloropyridine ・ 2-Chlorostyrene ・ 2-choice hashing ・ 2-coumarate O-beta-glucosyltransferase ・ 2-coumarate reductase ・ 2-Cyanoguanidine ・ 2-D Blacktop ・ 2-Decenedioic acid ・ 2-dehydro-3-deoxy-6-phosphogalactonate aldolase ・ 2-dehydro-3-deoxy-D-gluconate 5-dehydrogenase ・ 2-dehydro-3-deoxy-D-gluconate 6-dehydrogenase ・ 2-dehydro-3-deoxy-D-pentonate aldolase ・ 2-dehydro-3-deoxy-L-arabinonate dehydratase ・ 2-dehydro-3-deoxy-L-pentonate aldolase ・ 2-dehydro-3-deoxy-phosphogluconate aldolase ・ 2-dehydro-3-deoxygalactonokinase ・ 2-dehydro-3-deoxyglucarate aldolase Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク 2-choice hashing ： ウィキペディア英語版 2-choice hashing 2-choice hashing, also known as 2-choice chaining, is "a variant of a hash table in which keys are added by hashing with two hash functions. The key is put in the array position with the fewer (colliding) keys. Some collision resolution scheme is needed, unless keys are kept in buckets. The average-case cost of a successful search is O(2 + (m-1)/n), where m is the number of keys and n is the size of the array. The most collisions is $\backslash log\_2\; \backslash ln\; n\; +\; \backslash theta(m/n)$ with high probability."〔Paul E. Black, NIST, DADS〕 ==How It Works== 2-choice hashing utilizes two hash functions h1(x) and h2(x) which work as hash functions are expected to work (i.e. mapping integers from the universe into a specified range). The two hash functions should be independent and have no correlation to each other. Having two hash functions allows any integer x to have up to two potential locations to be stored based on the values of the respective outputs, h1(x) and h2(x). It is important to note that, although there are two hash functions, there is only one table; both hash functions map to locations on that table. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「2-choice hashing」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.